Efficient Implementation of Marching Cubes' Cases with Topological Guarantees

Marching Cubes’ methods first offered visual access to experimental and theoretical data. The implementation of this method usually relies on a small lookup table. Many enhancements and optimizations of Marching Cubes still use it. However, this lookup table can lead to cracks and inconsistent topology. This paper introduces a full implementation of Chernyaev’s technique to ensure a topologically correct result, i.e. a manifold mesh, for any input data. It completes the original paper for the ambiguity resolution and for the feasibility of the implementation. Moreover, the cube interpolation provided here can be used in a wider range of methods. The source code is available online.